Creating Minimal Vertex Series Parallel Graphs from Directed Acyclic Graphs
نویسنده
چکیده
Visualizing information whose underlying graph is directed acyclic is easier if the graph is Minimal Vertex Series Parallel (MVSP). We present method of transforming any directed acyclic graph into one that is MVSP. This enables an easy visualization of the information contained in the original graph. We illustrate this by an example of a schedule that contains parallelism.
منابع مشابه
Acyclically 3-Colorable Planar Graphs
In this paper we study the planar graphs that admit an acyclic 3-coloring. We show that testing acyclic 3-colorability is NP-hard, even for planar graphs of maximum degree 4, and we show that there exist infinite classes of cubic planar graphs that are not acyclically 3-colorable. Further, we show that every planar graph has a subdivision with one vertex per edge that admits an acyclic 3-colori...
متن کاملOptimal Reductions of Two-Terminal Directed Acyclic Graphs
Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with series and parallel reductions. A node reduction contracts a vertex with unit in-degree (out-degree) into its sole incoming (outgoing) neighbor. We give an O(n 2:5) algorithm for minimizing node reductions, based on vertex cover in a transitive auxiliary graph. Application...
متن کاملOptimal Reduction of Two - Terminal Directed Acyclic Graphs * Wolfgang
Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with series and parallel reductions. A node reduction contracts a vertex with unit in-degree (out-degree) into its sole incoming (outgoing) neighbor. This paper gives an O(n2"5) algorithm for minimizing node reductions, based on vertex cover in a transitive auxiliary graph. App...
متن کاملDirected Graph Embeddings
Definitions of graph embeddings and graph minors for directed graphs are introduced. For the class of 2-terminal directed acyclic graphs (TDAGs) the definitions coincide, and the class is closed under both operations. The usefulness of the directed embedding operation is demonstrated be characterizing all TDAGs with parallel-width at most $k$, which generalizes earlier characterizations of seri...
متن کاملWeb Grammars
Classes of "phrase-structure grammars" are defined whose "languages" consist, not of strings of symbols, but of directed graphs with symbols at their vertices ("webs"). Examples of such "web grammars" are given, having languages consisting of trees, of two-terminal series-parallel networks, and of "triangular" networks. It is shown that if the graphs permitted in a "context-sensitive" web gramm...
متن کامل